Lempel-Ziv Jaccard Distance, an effective alternative to ssdeep and sdhash
نویسندگان
چکیده
منابع مشابه
Lempel-Ziv Jaccard Distance, an Effective Alternative to Ssdeep and Sdhash
Recent work has proposed the Lempel-Ziv Jaccard Distance (LZJD) as a method to measure the similarity between binary byte sequences for malware classification. We propose and test LZJD’s effectiveness as a similarity digest hash for digital forensics. To do so we develop a high performance Java implementation with the same command-line arguments as sdhash, making it easy to integrate into exist...
متن کاملLempel-Ziv Dimension for Lempel-Ziv Compression
This paper describes the Lempel-Ziv dimension (Hausdorff like dimension inspired in the LZ78 parsing), its fundamental properties and relation with Hausdorff dimension. It is shown that in the case of individual infinite sequences, the Lempel-Ziv dimension matches with the asymptotical Lempel-Ziv compression ratio. This fact is used to describe results on Lempel-Ziv compression in terms of dime...
متن کاملMeasuring spike pattern reliability with the Lempel-Ziv-distance.
Spike train distance measures serve two purposes: to measure neuronal firing reliability, and to provide a metric with which spike trains can be classified. We introduce a novel spike train distance based on the Lempel-Ziv complexity that does not require the choice of arbitrary analysis parameters, is easy to implement, and computationally cheap. We determine firing reliability in vivo by calc...
متن کاملLightweight Lempel-Ziv Parsing
We introduce a new approach to LZ77 factorization that uses O(n/d) words of working space and O(dn) time for any d ≥ 1 (for polylogarithmic alphabet sizes). We also describe carefully engineered implementations of alternative approaches to lightweight LZ77 factorization. Extensive experiments show that the new algorithm is superior in most cases, particularly at the lowest memory levels and for...
متن کاملSpike train clustering using a Lempel-Ziv distance measure
Multi-electrode array recordings reveal complex structures in the firing of spatially distributed neurons. The analysis of this neuronal network activity demands a classification of neurons according to similarities in their firing behavior. If similar spike patterns do not occur synchronously, but have unknown delays within spike trains, this processing step is difficult. To solve this problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Investigation
سال: 2018
ISSN: 1742-2876
DOI: 10.1016/j.diin.2017.12.004